Low Cost and Fault Tolerant Parallel Computing Using Stochastic Two-Dimensional Finite State Machine
نویسندگان
چکیده
منابع مشابه
Using Two-Dimensional Finite State Machine for Stochastic Computation
Stochastic computational elements, which perform computation based on stochastic bit streams, have several advantages compared to deterministic computational elements, such as high fault-tolerance and low hardware cost. Additionally, researchers have shown that a linear Finite State Machine (FSM) can be used to compute some functions stochastically, such as the exponentiation and tanh functions...
متن کاملFault Tolerant Finite State Control using Low Density Parity Checking
Digital technology in space-bound, nanometer scale systems create the need for reliable computation in the face of a small but finite error rate. We present a designerdriven, semi-automated technique for synthesizing fault tolerance in finite state machines. This is done with lower implementation overhead in terms of both machine redundancy and overall logic complexity than conventional methods...
متن کاملFinite State Machine Synthesis with Fault Tolerant Test hnction
In a recent proposal a test function, which is a finite state machine with the same number of state variables as the given object machine, is incorporated into the state diagram of the object machine. Since a complete verification of the test machine ss impractical, an often used heuristic sets and observes each state variable. As the two machines share logic, a fault can reeult in partial or t...
متن کاملA Low Cost Fault Tolerant Packet Routing for Parallel Computers
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be applied to any regular or irregular topology, in this paper we focus on its application to k-ary n-cube networks when managing both synthetic and real traffic workloads. Our mechanism is effective regardless the number...
متن کاملLatency in local, two-dimensional, fault-tolerant quantum computing
We analyze the latency of fault-tolerant quantum computing based on the 9-qubit Bacon-Shor code using a local, two-dimensional architecture. We embed the data qubits in a 7 by 7 array of physical qubits, where the extra qubits are used for ancilla preparation and qubit transportation by means of a SWAP chain. The latency is reduced with respect to a similar implementation using Steane’s 7-qubit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2017
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2017pal0003